On k-regular embeddings of spaces in Euclidean space

Optimal distortion embeddings of distance regular graphs into Euclidean spaces

In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular graphs. Our technique involves semidefinite programming and exploiting the algebra structure of the optimization problem so that the question of finding a lowe...

On Embeddings of Tori in Euclidean Spaces

Embeddings of Surfaces in Euclidean Three-space

Computability on Regular Subsets of Euclidean Space

For the computability of subsets of real numbers, several reasonable notions have been suggested in the literature. We compare these notions in a systematic way by relating them to pairs of ‘basic’ ones. They turn out to coincide for full-dimensional convex sets; but on the more general class of regular sets, they reveal rather interesting ’weaker/stronger’ relations. This is in contrast to sin...

Bilipschitz Embeddings of Metric Spaces into Euclidean Spaces

When does a metric space admit a bilipschitz embedding into some finite-dimensional Euclidean space? There does not seem to be a simple answer to this question. Results of Assouad [A1], [A2], [A3] do provide a simple answer if one permits some small (“snowflake”) deformations of the metric, but unfortunately these deformations immediately disrupt some basic aspects of geometry and analysis, lik...